An Efficient Implementation of Braid Groups

نویسندگان

  • Jae Choon Cha
  • Ki Hyoung Ko
  • Sangjin Lee
  • Jae Woo Han
  • Jung Hee Cheon
چکیده

We implement various computations in the braid groups via practically efficient and theoretically optimized algorithms whose pseudo-codes are provided. The performance of an actual implementation under various choices of parameters is listed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Irreducibility of the tensor product of Albeverio's representations of the Braid groups $B_3$ and $B_4$

‎We consider Albeverio's linear representations of the braid groups $B_3$ and $B_4$‎. ‎We specialize the indeterminates used in defining these representations to non zero complex numbers‎. ‎We then consider the tensor products of the representations of $B_3$ and the tensor products of those of $B_4$‎. ‎We then determine necessary and sufficient conditions that guarantee the irreducibility of th...

متن کامل

Efficient solutions to the braid isotopy problem

We describe the most efficient solutions to the word problem of Artin’s braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy problem, including the Dynnikov method, which could be especially suitable for cryptographical applications. Most results appear in literature; however, some results about the greedy normal form and the symmetric normal form an...

متن کامل

A Gathering Process in Artin Braid Groups

In this paper we construct a gathering process by the means of which we obtain new normal forms in braid groups. The new normal forms generalise Artin-Markoff normal forms and possess an extremely natural geometric description. In the two last sections of the paper we discuss the implementation of the introduced gathering process and the questions that arose in our work. This discussion leads u...

متن کامل

Efficient Group Key Agreement on Tree-based Braid Groups

The security issues in ad hoc network are increasingly important. In this paper, we propose a distributed key management what approach by using braid groups and key tree. Without any assumption of prefixed trust relationship between nodes, the proposed method works in a self-organizing way to provide the key management services. The using of the proposed tree-based braid groups has following ad...

متن کامل

Reu 2011: the Conjugacy Problem in Group Theory

At the center of every crypto system lies a mathematical trapdoor, that is, a computational problem that is easy to perform in one direction (encryption) but difficult to reverse (decryption). The security of the system depends on the difficulty of the reverse computation. The most common problems used are the computation of prime factorizations and the computation of discrete logarithms. These...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001